The arborescence-realization problem
نویسندگان
چکیده
منابع مشابه
The Gilbert arborescence problem
We investigate the problem of designing a minimum-cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of additional unprescribed nodes from the space; these are known as the Steiner points. For concave increasing cost functions, a minimum cost network of this sort h...
متن کاملFast Optimal Algorithms for the Minimum Rectilinear Steiner Arborescence Problem
| In this paper, we present two optimal algorithms for solving the Minimum Rectilinear Steiner Arborescence (MRSA) Problem. The rst algorithm is a recursive branch-and-bound variant of the RSA heuristic by Rao et al. [14]. The second algorithm uses dynamic programming to avoid solving the same subproblemmore than once. Furthermore, both algorithms can be generalized to solve the All-Quadrant MR...
متن کاملA Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem
In this paper an inverse problem of the weighted shortest arborescence problem is discussed. That is. given a directed graph G and a set of nonnegative costs on its arcs. we need to modify those costs as little as possible to ensure that T, a given (.I-arborescence of G, is the shortest one. It is found that only the cost of T needs modifying. An O(rz”) combinatorial algorithm is then proposed....
متن کاملPolynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
Abst ract Given a set N of n terminals in the rst quadrant of the Euclidean plane E 2 , nd a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horiz on tal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem. which has been proved to be NP-complete recentl...
متن کاملThe Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete
In the rectilinear Steiner arborescence problem the task is to build a shortest rectilinear Steiner tree connecting a given root and a set of terminals which are placed in the plane such that all root-terminal-paths are shortest paths. This problem is known to be NP-hard. In this paper we consider a more restricted version of this problem. In our case we have a depth restrictions d(t) ∈ N for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)80005-o